Ranking Adaptation Svm for Target Domain Search

نویسندگان

  • M. S. Gayathri
  • S. Leela
چکیده

With the growth of different search engines, it becomes difficult for an user to search particular information effectively. If a search engine could provide domain specific information such as that confines only to a particular topicality, it is referred to as domain specific engine. Applying the ranking model trained for broad-based search to a domain specific search does not achieve good performance because of domain differences. Building a different ranking model for each domain is laborious and time consuming. In this paper, the ranking model used in broad-based search is adapted to domain specific search. An algorithm called Ranking Adaptation SVM is used to effectively adapt a ranking model to a target domain. Such an adaptation has advantages since it needs only the predictions from existing ranking models. Ranking Adaptability measurement is used to quantitatively estimate whether a ranking model can be adapted to new domain.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adapting a Ranking Model for Domain-Specific Search

An adaptation process is described to adapt a ranking model constructed for a broad-based search engine for use with a domain-specific ranking model. It’s difficult to applying the broad-based ranking model directly to different domains due to domain differences, to build a unique ranking model for each domain it time-consuming for training models. In this paper,we address these difficulties by...

متن کامل

Ranking Model for Domain Specific Search

Learning to rank is an important area at the interface of machine learning, information retrieval and Web search. The technology has been successfully applied to web search, and is becoming one of the key machines for building search engines. The central challenge in optimizing various measures of ranking loss is that the objectives tend to be non-convex and discontinuous. In recent years, boos...

متن کامل

Applying Co-training to Clickthrough Data for Search Engine Adaptation

The information on the World Wide Web is growing without bound. Users may have very diversified preferences in the pages they target through a search engine. It is therefore a challenging task to adapt a search engine to suit the needs of a particular community of users who share similar interests. In this paper, we propose a new algorithm, Ranking SVM in a Co-training Framework (RSCF). Essenti...

متن کامل

Deep Unsupervised Domain Adaptation for Image Classification via Low Rank Representation Learning

Domain adaptation is a powerful technique given a wide amount of labeled data from similar attributes in different domains. In real-world applications, there is a huge number of data but almost more of them are unlabeled. It is effective in image classification where it is expensive and time-consuming to obtain adequate label data. We propose a novel method named DALRRL, which consists of deep ...

متن کامل

Cross-Market Model Adaptation with Pairwise Preference Data for Web Search Ranking

Machine-learned ranking techniques automatically learn a complex document ranking function given training data. These techniques have demonstrated the effectiveness and flexibility required of a commercial web search. However, manually labeled training data (with multiple absolute grades) has become the bottleneck for training a quality ranking function, particularly for a new domain. In this p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013